A note on a formalized arithmetic with function symbols ' and $+$

A Randomized Satisfiability Procedure for Arithmetic and Uninterpreted Function Symbols

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., i...

A Randomized Satisfability Procedure for Arithmetic and Uninterpreted Function Symbols

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., i...

compactifications and function spaces on weighted semigruops

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

A note on symbols, syntax and sets

In this note I discuss some aspects of the role of symbols in mathematics. I concentrate on the mathematical treatment of mathematical symbols in the context of the syntax of formal systems, and I deal with the relationship of the concept of symbol with the notions of abstraction and set.

Analyzing Automata with Presburger Arithmetic and Uninterpreted Function Symbols